The Fail-Stop Processor Approach*

نویسندگان

  • Fred B. Schneider
  • Bharat Bhargava
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms

This paper deals with the reliability of task graph schedules with transient and fail-stop failures. While computing the reliability of a given schedule is easy in the absence of task replication, the problem becomes much more difficult when task replication is used. We fill a complexity gap of the scheduling literature: our main result is that this reliability problem is #P’-Complete (hence at...

متن کامل

On the complexity of task graph scheduling with transient and fail-stop failures

This paper deals with the complexity of task graph scheduling with transient and fail-stop failures. While computing the reliability of a given schedule is easy in the absence of task replication, the problem becomes much more difficult when task replication is used. Our main result is that this problem is #P’Complete (hence at least as hard as NP-Complete problems), with both transient and fai...

متن کامل

cient Computations on fault - prone BSP machines

In this paper general simulations of algorithms designed for fully operational BSP machines on BSP machines with faulty processors or unavailable processors are developed. The fail-stop model is considered, that is, if a processor fails or becomes unavailable it remains so until the end of the computation. The faults are random, that is, a processor may fail independently with probablility a, a...

متن کامل

Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms

The CRCW PRAM under dynamic fail-stop (no restart) processor behavior is a fault-prone multiprocessor model for which it is possible to both guarantee reliability and preserve eeciency. To handle dynamic faults some redundancy is necessary in the form of many processors concurrently performing a common read or write task. In this paper we show how to signiicantly decrease this concurrency by bo...

متن کامل

Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments

Increasing popularity and diversity of collaborative applications prompts the need for highly secure and reliable communication platforms for dynamic peer groups. Security mechanisms for such groups tend to be both expensive and complex and their integration with reliable group communication services presents a formidable challenge. This paper discusses some important integration issues, report...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1984